Boundary-trimmed 3D triangular mesh segmentation based on iterative merging strategy

نویسندگان

  • Dong Hwan Kim
  • Il Dong Yun
  • Sang Uk Lee
چکیده

This paper presents a segmentation algorithm for 3D triangular mesh data. The proposed algorithm uses iterative merging of adjacent triangle pairs based on their orientations. The oversegmented regions are merged again in an iterative region merging process. Finally, the noisy boundaries of each region are refined. The boundaries of each region contain perceptually important geometric information of the entire mesh model. According to the purpose of the segmentation, the proposed mesh-segmentation algorithm supports various types of segmentation by controlling parameters. 2006 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hierarchical 3D Segmentation Using Connected Face Structure

This paper describes a new approach for watershed segmentation on triangular mesh. Common watershed approaches use descending or flooding processes on a connected vertex structure. Watershed transformation is not related to a structure in particular: it only requires connected elements and a height function. This method is widely used on 2D, 3D images as well as on 3D meshes. Here, a connected ...

متن کامل

A New 3-D Mesh Simplificatión Algorithm

To simplify the 3D color head mesh ,it is more important to keep the boundary and quality of the head’s sense organs including eyes, eyebrows, nose and mouth. In this paper, we present a novel mesh simplification algorithm based on region segmentation. The algorithm can be divided into two stages: segmentation and simplification. After the automatic segmentation of 3D color head mesh into diffe...

متن کامل

3d Mesh Segmentation Using Local Geometry

We develop an algorithm to segment a 3D surface mesh intovisually meaningful regions based on analyzing the local geometry ofvertices. We begin with a novel characterization of mesh vertices as convex,concave or hyperbolic depending upon their discrete local geometry.Hyperbolic and concave vertices are considered potential feature regionboundaries. We propose a new region growing technique star...

متن کامل

Automatic Aortic Root Segmentation with Shape Constraints and Mesh Regularisation

A non-invasive procedure called Transcatheter Aortic Valve Implantation (TAVI) has emerged as an alternative procedure for patients suffering with aortic stenosis, but cannot undergo standard open-heart surgery. A full segmentation of the aortic root is important to the success of the procedure, and is essential for patient selection, procedural planning, and post-evaluation [1]. We propose a f...

متن کامل

Transformation of a closed 3D triangular mesh to a quadrilateral mesh based on feature edges

In this paper, we propose a method of applying the Q-Morph to the closed three-dimensional triangular mesh. The Q-Morph is the method in order to transform the triangular mesh to the quadrilateral mesh. The Q-morph begins quadrilateral transformation from the initial front edges which are usually the boundary of the 2D domain. Also, the Q-Morph can be applied to the 3D domain. But, the closed 3...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Pattern Recognition

دوره 39  شماره 

صفحات  -

تاریخ انتشار 2006